C_3,C_4,C_5,C_7)-free almost well-dominated graphs
نویسندگان
چکیده
منابع مشابه
Locally Well-Dominated and Locally Independent Well-Dominated Graphs
In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the independent domination number can be computed in polynomial time within several classes of graphs, e....
متن کاملAlmost Well-Covered Graphs Without Short Cycles
We study graphs in which the maximum and the minimum sizes of a maximal independent set differ by exactly one. We call these graphs almost well-covered, in analogy with the class of well-covered graphs, in which all maximal independent sets have the same size. A characterization of graphs of girth at least 8 having exactly two different sizes of maximal independent sets due to Finbow, Hartnell,...
متن کاملShortest walks in almost claw-free graphs
There have been many results concerning claw-free graphs and hamiltonicity. Recently, Jackson and Wormald have obtained more general results on walks in claw-free graphs. In this paper, we consider the family of almost claw-free graphs that contains the previous one, and give some results on walks, especially on shortest covering walks visiting only once some given vertices. Throughout the pape...
متن کاملWell-Covered Claw-Free Graphs
We prove the existence of a polynomial time algorithm to tell whether a graph, with no induced subgraph isomorphic to K1.3 , is well covered. A graph is wellcovered if all its maximal independent sets are of the same cardinality. The problem is known to be polynomialy solvable where the input graph is a line graph and it is NP-hard for the larger family of all graphs which do not contain an ind...
متن کاملWell-dominated graphs without cycles of lengths 4 and 5
Let G be a graph. A set S of vertices in G dominates the graph if every vertex of G is either in S or a neighbor of a vertex in S. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph G is well-dominated if all its minimal dominating sets are of the same cardinality. The complexity status of recognizing well-dominated graphs is not known. We show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2331